I/O-Conscious Volume Rendering

نویسندگان

  • Chuan-Kai Yang
  • Tzi-cker Chiueh
چکیده

Most existing volume rendering algorithms assume that data sets are memory-resident and thus ignore the performance overhead of disk I/O. While this assumption may be true for high-performance graphics machines, it does not hold for most desktop personal workstations. To minimize the end-to-end volume rendering time, this work re-examines implementation strategies of the ray casting algorithm, taking into account both computation and I/O overheads. Specifically, we developed a data-driven execution model for ray casting that achieves the maximum overlap between rendering computation and disk I/O. Together with other performance optimizations, on a 300-MHz Pentium-II machine, without directional shading, our implementation is able to render a 128x128 grey-scale image from a 128x128x128 data set with an average end-to-end delay of 1 second, which is very close to the memory-resident rendering time. To explore the feasibility of automatically converting memory-resident algorithms into I/O-conscious ones, this paper presents an application-specific file system that transparently maximizes the overlap between disk I/O and computation without requiring application modifications.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Assessing and Improving Large Scale Parallel Volume Rendering on the IBM Blue Gene/P

Computational science’s march toward the petascale demands innovations in analysis and visualization of the resulting datasets. As scientists generate terabyte and petabyte data, it is insufficient to measure the performance of visual analysis algorithms by rendering speed only, because performance is dominated by data movement. We take a systemwide view in analyzing the performance of software...

متن کامل

Visualization and parallel I/O at extreme scale

In our efforts to solve ever more challenging problems through computational techniques, the scale of our compute systems continues to grow. As we approach petascale, it becomes increasingly important that all the resources in the system be used as efficiently as possible, not just the floating-point units. Because of hardware, software, and usability challenges, storage resources are often one...

متن کامل

A Software Architecture for Distributed Volume Rendering on Hpc Systems

We present a scalable software architecture for distributed direct volume rendering on HPC systems. Our approach allows for generically replacing components along the distributed volume rendering pipeline. Renderer components range from highly specialized GPU renderers that implement state of the art features to more versatile remote renderers, that can make use of numerous distributed memory n...

متن کامل

A Parallel Pipelined Renderer for the Time-Varying Volume Data

This paper presents a strategy for efficiently rendering time-varying volume data sets on a distributedmemory parallel computer. Time-varying volume data take large storage space and visualizing them requires reading large files continuously or periodically throughout the course of the visualization process. Instead of using all the processors to collectively render one volume at a time, a pipe...

متن کامل

Parallel Volume Rendering on the IBM Blue Gene/P

Parallel ray casting volume rendering is implemented and tested on an IBM Blue Gene distributed memory parallel architecture. Data are presented from experiments under a number of different conditions, including dataset size, number of processors, low and high quality rendering, offline storage of results, and streaming of images for remote display. Performance is divided into three main sectio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001